Transforming certificates of program correctness along justified program transformations
نویسندگان
چکیده
A certificate is a mathematical object that can be used to establish that a piece of mobile code satisfies some security policy. Since in general certificates cannot be generated automatically, there is an interest in developing methods to reuse certificates. This article studies methods that transform certificates of a program into certificates of another program derived from the initial one by a semantically justified program transformation. We also study the related problem to transform certificates of a program instrumented with the results of a semantically justified program analysis, into a certificate of the original program. The transformations are conveniently described in the setting of abstract interpretation. We illustrate applications of our results to certificate translation and to the justification of hybrid certificates.
منابع مشابه
Certificate Translation in Abstract Interpretation
A certificate is a mathematical object that can be used to establish that a piece of mobile code satisfies some security policy. Since in general certificates cannot be generated automatically, there is an interest in developing methods to reuse certificates. This article formalises in the setting of abstract interpretation a method to transform certificates of program correctness along program...
متن کاملA An Abstract Model of Certificate Translation
A certificate is a mathematical object that establishes the validity of a logical formula and that is self-contained, self-explanatory, and can be checked independently and automatically. Certificates arise naturally in many areas of mathematics, and in many different forms. In particular, certificates are common in the context of program verification, where they are used for automatic checking...
متن کاملTotally correct logic program transformations via well-founded annotations
We address the problem of proving the total correctness of transformations of definite logic programs. We consider a general transformation rule, called clause replacement, which consists in transforming a program P into a new program Q by replacing a set Γ1 of clauses occurring in P by a new set Γ2 of clauses, provided that Γ1 and Γ2 are equivalent in the least Herbrand model M(P) of the progr...
متن کاملCorrect Transformations of Logic Programs
This paper describes a system of transformations that preserves the semantics of logic programs with respect to a xed goal. We formalise some standard transformations and introduce two new transformation rules: Copying/Merge of Copies and Contextual Replacement by Equal Term. Correctness of all schemes of the transformation rules is proved. The applicability conditions of the schemes of rules a...
متن کاملProgram Checking with Certificates: Separating Correctness-Critical Code
We introduce program checking with certificates by extending the traditional notion of black-box program checking. Moreover, we establish program checking with certificates as a safety-scalable and practical method to ensure the correctness of real-scale applications. We motivate our extension of program checking with concepts of computational complexity theory and show its practical implicatio...
متن کامل